Nonnegative Mixed-Norm Convex Optimization for Mitotic Cell Detection in Phase Contrast Microscopy

نویسندگان

  • Anan Liu
  • Tong Hao
  • Zan Gao
  • Yuting Su
  • Zhaoxuan Yang
چکیده

This paper proposes a nonnegative mix-norm convex optimization method for mitotic cell detection. First, we apply an imaging model-based microscopy image segmentation method that exploits phase contrast optics to extract mitotic candidates in the input images. Then, a convex objective function regularized by mix-norm with nonnegative constraint is proposed to induce sparsity and consistence for discriminative representation of deformable objects in a sparse representation scheme. At last, a Support Vector Machine classifier is utilized for mitotic cell modeling and detection. This method can overcome the difficulty in feature formulation for deformable objects and is independent of tracking or temporal inference model. The comparison experiments demonstrate that the proposed method can produce competing results with the state-of-the-art methods.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Bowling Scheme

This chapter develops a theoretical analysis of the convex programming method for recovering a structured signal from independent random linear measurements. This technique delivers bounds for the sampling complexity that are similar with recent results for standard Gaussian measurements, but the argument applies to a much wider class of measurement ensembles. To demonstrate the power of this a...

متن کامل

Phase Contrast Image Restoration via Dictionary Representation of Diffraction Patterns

The restoration of microscopy images makes the segmentation and detection of cells easier and more reliable, which facilitates automated cell tracking and cell behavior analysis. In this paper, the authors analyze the image formation process of phase contrast images and propose an image restoration method based on the dictionary representation of diffraction patterns. By formulating and solving...

متن کامل

Finding Approximately Rank-One Submatrices with the Nuclear Norm and 퓁1-Norm

We propose a convex optimization formulation with the nuclear norm and `1-norm to find a large approximately rank-one submatrix of a given nonnegative matrix. We develop optimality conditions for the formulation and characterize the properties of the optimal solutions. We establish conditions under which the optimal solution of the convex formulation has a specific sparse structure. Finally, we...

متن کامل

Nonnegative Mixed-Norm Preconditioning for Microscopy Image Segmentation

Image segmentation in microscopy, especially in interference-based optical microscopy modalities, is notoriously challenging due to inherent optical artifacts. We propose a general algebraic framework for preconditioning microscopy images. It transforms an image that is unsuitable for direct analysis into an image that can be effortlessly segmented using global thresholding. We formulate precon...

متن کامل

Approximation Algorithms for Mixed Fractional Packing and Covering Problems

We propose an approximation algorithm based on the Lagrangian or price directive decomposition method to compute an -approximate solution of the mixed fractional packing and covering problem: find x 2 B such that f(x) (1 + )a, g(x) (1 )b where f(x); g(x) are vectors with M nonnegative convex and concave functions, a and b are M dimensional nonnegative vectors and B is a convex set that can be q...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره 2013  شماره 

صفحات  -

تاریخ انتشار 2013